The code is publicly available at https://github.com/jinnh/GSAD.

This supplementary document is organized as follows: Section 1 shows the proof that the formula of FRFT degrades to that of FT when α = π/ 2. Section 2 shows the discrete implementation of 2D FRFT. Section 4 shows the experimental results with single branch. Section 5 shows the architecture design of SFC and example usage of SFC and MFRFC. Section 6 introduces the periodicity of FRFT. Section 7 introduces the energy distribution of FRFT.

These techniques calibrate an initial non-metric distance matrix estimated on incomplete data to a distance metric.

We propose a new algorithm for the problem of recovering data that adheres to multiple, heterogeneous low-dimensional structures from linear observations.

This paper examines learning the optimal filtering policy, known as the Kalman gain, for a linear system with unknown noise covariance matrices using noisy output data. The learning problem is formulated as a stochastic policy optimization problem, aiming to minimize the output prediction error. This formulation provides a direct bridge between data-driven optimal control and, its dual, optimal filtering.